Coefficients of the Riemann map for the Mandelbrot set complement

We propose a numerical algorithm for the approximate computation of coefficients standardized Riemann map complement Mandelbrot set. Let $ f_c(z) = z^2+c be standard representation quadratic family and \mathcal{M} set \Psi : \overline{ \mathbb{C}}\setminus \mathbb{D}(0, 1)} \rightarrow \mathbb{C}} \setminus is normalized map. In introduced approach, we start with Fourier transform given formula \Psi^{-1}(c) \lim_{n\rightarrow \infty} \sqrt[2^n]{f^n_c(c)} $. The fast implementation reduces problem to simple relation, solvable Newton's method. above will enable us compute 2^{n+1} in O\left( n 2^n\right) operations obtain up 24 on hardware. Collected data suggest that decay fairly quickly but insufficiently make sequence summable. approach article can further implemented parallelly due parallel transform.